Structured Specifications and Implementation of Nondeterministic Data Types

نویسندگان

  • Michal Walicki
  • Manfred Broy
چکیده

The use of nondeterminism in speci cations as distinct from underspeci cation is moti vated by an example in the context of data re nement A simple formalism for specifying nondeterministic data types is introduced Its semantics is given in terms of the existing formalisms of relations multialgebras sets of functions and oracles by means of appropri ate translation rules Nondeterministic data re nement is studied from the syntactic and semantic perspective and the correctness of the suggested proof obligations is proved More general the implementation relation and parameterisation of nondeterministic data types are discussed and the standard theorems of vertical and horizontal composition are generalized to the nondeterministic case

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nondeterministic Operators in Algebraic Frameworks

A major motivating force behind research into abstract data types and algebraic specifications is the realization that software in general and types in particular should be described (“specified”) in an abstract manner. The objective is to give specifications at some level of abstraction: on the one hand leaving open decisions regarding further refinement and on the other allowing for substitut...

متن کامل

Data Refinement for Verified Model-Checking Algorithms in Isabelle/HOL

Our goal is to verify model-checking algorithms with Isabelle/HOL. When regarding such algorithms on an abstract level, they often use nondeterminism like ”take an element from this set”. Which element is actually taken depends on the concrete implementation of the set. When formalizing these algorithms, one has to either fix the concrete implementation for the correctness proof, or describe th...

متن کامل

Controllersynthesis Forprobabilistic Systems ( Extended

Controller synthesis addresses the question of how to limit the internal behavior of a given implementation to meet its specification, regardless of the behavior enforced by the environment. In this paper, we consider a model with probabilism and nondeterminism where the nondeterministic choices in some states are assumed to be controllable, while the others are under the control of an unpredic...

متن کامل

Abstract Dynamic Data Types: A Temporal Logic Approach

A concrete dynamic-data type is just a partial algebra with predicates such that for some of the sorts there is a special predicate defining a transition relation. An abstract dynamic-data type (ad-dt) is an isomorphism class of such algebras. To obtain specifications for ad-dt’s, we propose a logic which combines many-sorted first-order logic with branching-time combinators. We consider both a...

متن کامل

Synthesizing Structured Analysis and Object-Oriented Specifications

Structured Analysis (SA) is a widely-used software development method. SA specifications are based on Data Flow Diagrams (DFD's), Data Dictionaries (DD's) and data transformation specifications (P-Specs). As used in practice, SA specifications are not formal. Seemingly orthogonal approaches to specifications are those using formal, object-oriented, model-based specification languages, e.g., VDM...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Nord. J. Comput.

دوره 2  شماره 

صفحات  -

تاریخ انتشار 1995